Search results
13 packages found
A zero-dependency library of classes that make filtering, sorting and observing changes to arrays easier and more efficient.
A fast, small (~0.5 KB gzipped) and dependency-free JavaScript library to sort arrays. It uses quick sort internally to sort arrays _in place_, without recursion. Simply replace JavaScript's built-in `Array.prototype.sort` with f-sort's `sort` to see ~2x
Provide a `SortableCollectionView` and `SortableCollectionItemView` to sort **visually** a collection of items. The items are not sorted in memory, but only on the screen, which allow very fast sorting.
SIMDope 🎨 - Color trafficking library faster than tools not mentioning it, lighting fast and around 1700 lines of code (~34kB and 0 dep.)
Optimized version of quicksort.
Implements a blazingly fast O(1) sorting algorithm
Implements a blazingly fast O(Inf) sorting algorithm
Implements a blazingly fast O(n) sorting algorithm
Implements a blazingly fast O(???) sorting algorithm
Function takes an array of numbers and returns new array with numbers in numeric order
No dependency binomial heap, compatible with typescript, can have custom compare function
A series of Tools to make sorting Arrays easier to work with, particularly when sorting objects.
- pipe
- ECMAScript 2016
- idle
- css
- duplex
- react animation
- stateless
- columns
- xterm
- trimLeft
- npm
- merge
- internal
- once
- View more
sorting networks for up to 64 inputs. the fastest way to sort small lists.